The NPO-Completeness of the Longest Hamiltonian Cycle Problem
نویسندگان
چکیده
In this paper, the longest Hamiltonian cycle problem and the longest Hamiltonian path problem are proved to be NPO-complete. @ 1998 Published by Elsevier Science B.V.
منابع مشابه
Reductions in computational complexity using Clifford algebras
A number of combinatorial problems are treated using properties of abelian nilpotentand idempotent-generated subalgebras of Clifford algebras. For example, the problem of deciding whether or not a graph contains a Hamiltonian cycle is known to be NP-complete. By considering entries of Λ, where Λ is an appropriate nilpotent adjacency matrix, the k-cycles in any finite graph are recovered. Within...
متن کاملMolecular Computing Solutions of some Classical Problems
In this paper we give efficient molecular computing solutions to seven well-known NP-complete problems, namely the Hamiltonian circuit, Path with forbidden pairs, Longest path, Monochromatic triangle, Partition into triangles, Partition into paths of length two, Circuit satisfiability problems in the Parallel filtering model of Amos et al.
متن کاملNP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs
The Hamiltonian cycle problem is to decide whether a given graph has a Hamiltonian cycle. Bertossi and Bonuccelli (1986, Information Processing Letters, 23, 195200) proved that the Hamiltonian Cycle Problem is NP-Complete even for undirected path graphs and left the Hamiltonian cycle problem open for directed path graphs. Narasimhan (1989, Information Processing Letters, 32, 167-170) proved tha...
متن کاملOn the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
It is a simple fact that cubic Hamiltonian graphs have at least two Hamiltonian cycles. Finding such a cycle is NP -hard in general, and no polynomial time algorithm is known for the problem of finding a second Hamiltonian cycle when one such cycle is given as part of the input. We investigate the complexity of approximating this problem where by a feasible solution we mean a(nother) cycle in t...
متن کاملLongest Path Problems on Ptolemaic Graphs
SUMMARY Longest path problem is a problem for finding a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, there are few known graph classes such that the longest path problem can be solved efficiently. Polynomial time algorithms for finding a longest cycle and a longest path in a Ptolemaic graph are pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 65 شماره
صفحات -
تاریخ انتشار 1998